Subliminal Channels in Visual Cryptography
نویسندگان
چکیده
This paper describes three methods of creating a subliminal channel in visual cryptography that are defined for (2,2) sharing scheme. They work by hiding additional covert information besides the original encrypted image. The first is revealed when user folds share along specific axis. second encodes subpixels on basis message bits. It designed to hide wide range data types. third may be applied single or multiple shares and proper parts stacked. Fold overlapping algorithms adequate printed shares, but encryption method only suitable digital shares. capacity these ranges from half image size whole size. presented black-and-white images expandable color cryptography. find applications steganography other data-hiding techniques. created channels do not interfere with regular still stacking In short, this article introduces cryptography, presents both binary colorful images, shows examples use results obtained, discusses features each method.
منابع مشابه
Subliminal Visual Priming
Masked pictures of objects were flashed so briefly that only 13.5% of them could be named. Forced-choice accuracy for the unidentified objects was at chance. When the pictures were shown again, about 15 min and 20 intervening trials later, without any indication of possible repetitions, naming accuracy increased to 34.5%. The priming was completely visual, rather than semantic or verbal, as the...
متن کاملThe History of Subliminal Channels
In 1978 the United States was considering adopting a national security protocol designed to enable the U.S.S.R. to verify how many Minuteman missiles the United States had emplaced in a field of 1000 silos without revealing which silos actually contained missiles. For this protocol to have been acceptable to the U.S.S.R., the messages would have had to be digitally signed with signatures which ...
متن کاملOn Subliminal Channels in Deterministic Signature Schemes
Subliminal channels in randomized signature algorithms like the DSA are well-known. However, much less seems to be known about this issue when dealing with deterministic schemes. Using some known signature schemes like ESIGN-D and SFLASH as example, we illustrate the problem of subliminal channels in non-interactive deterministic signature algorithms. Based on an appropriate formalization, a de...
متن کاملExploring Subliminal Channels in Pairing-Based Signatures
The prisoners’ problem, introduced by Simmons in 1983, describes how two individuals attempt to communicate covertly by exploiting subliminal channels without alerting a ”warden” who controls the communication. Via subliminal channels it is possible to transmit covert messages by embedding them into cryptographic digital data (traditionally by exploiting randomness that is used in probabilistic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cryptography
سال: 2022
ISSN: ['2410-387X']
DOI: https://doi.org/10.3390/cryptography6030046